Remarks on Recursion vs. Diagonalization
نویسنده
چکیده
Results are presented which show precise ways in which recursion rests on very simple computational bases which do not support diagonalization. A method based on recursion and making no use of diagonalization is given for proving lower bounds on computational complexity. Thus the intractability of computational problems such as Presburger arithmetic does not depend on diagonalization. This research was supported in part by the National Science Foundation under Grant MCS-76-09212. This note is a preliminary report of continuing research. Its purpose is limited dissemination to interested experts, and it should be regarded and treated accordingly. Remarks on Recursion vs. Diagonalization Michael Machtey Purdue University Department of Computer Sciences West Lafayette, Indiana 47907 November, 1977 (retyped July, 1979)
منابع مشابه
The diagonalization method in quantum recursion theory
As quantum parallelism allows the effective co-representation of classical mutually exclusive states, the diagonalization method of classical recursion theory has to bemodified.Quantumdiagonalization involves unitary operatorswhose eigenvalues are different from one.
متن کاملInfinitely-Often Universal Languages and Diagonalization
Diagonalization is a powerful technique in recursion theory and in computational complexity [2]. The limits of this technique are not clear. On the one hand, many people argue that conflicting relativizations mean a complexity question cannot be resolved using only diagonalization. On the other hand, it is not clear that diagonalization arguments necessarily relativize. In [5], the authors prop...
متن کاملPriority Arguments in Complexity Theory
machine-independent) complexity theory is basically a theory which establishes limits on what may be said about the complexity of specific recursive functions. (For example, the speed-up theorem [1] shows that it is not always possible to discover close upper and lower bounds for the complexity of a function.) As such, its basic proof method is diagonalization. Sacks, Spector, etc. [2], [3] hav...
متن کاملA decidable characterization of the classes between lintime and exptime
A language is defined by closure under safe iteration and under a new form of safe diagonalization that, unlike other forms of diagonalization used in literature to define sub-recursive hierarchies, is constructive and decidable. By counting the nesting levels of these schemes, an ordinal is assigned to each program. This yields a hierarchy Tα (α < ωω) that singles-out the complexity classes DT...
متن کاملOn the Brightness of the Thomson Lamp: A Prolegomenon to Quantum Recursion Theory
Some physical aspects related to the limit operations of the Thomson lamp are discussed. Regardless of the formally unbounded and even infinite number of “steps” involved, the physical limit has an operational meaning in agreement with the Abel sums of infinite series. The formal analogies to accelerated (hyper-) computers and the recursion theoretic diagonal methods are discussed. As quantum i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011